Cycle double covers and the semi-Kotzig frame
نویسندگان
چکیده
Let H be a cubic graph admitting a 3-edge-coloring c : E(H) → Z3 such that the edges colored with 0 and μ ∈ {1, 2} induce a Hamilton circuit of H and the edges colored with 1 and 2 induce a 2-factor F . The graph H is semi-Kotzig if switching colors of edges in any even subgraph of F yields a new 3-edge-coloring ofH having the same property as c . A spanning subgraphH of a cubic graph G is called a semi-Kotzig frame if the contracted graph G/H is even and every non-circuit component of H is a subdivision of a semi-Kotzig graph. In this paper, we show that a cubic graph G has a circuit double cover if it has a semi-Kotzig frame with at most one noncircuit component. Our result generalizes some results of Goddyn [L.A. Goddyn, Cycle covers of graphs, Ph.D. Thesis, University of Waterloo, 1988], and Häggkvist and Markström [R. Häggkvist, K. Markström, Cycle double covers and spanning minors I, J. Combin. Theory Ser. B 96 (2006) 183–206]. © 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
Cycle Double Covers of Graphs with Disconnected Frames
Continuing work initiated by Häggkvist and Markström, we show in this paper that certain disconnected frames guarantee the existence of a cycle double cover. Specifically, we show that the disjoint union of a Kotzig and a sturdy graph forms a good frame.
متن کاملKotzig frames and circuit double covers
A cubic graph H is called a Kotzig graph if H has a circuit double cover consisting of three Hamilton circuits. It was first proved by Goddyn that if a cubic graph G contains a spanning subgraph H which is a subdivision of a Kotzig graph then G has a circuit double cover. A spanning subgraph H of a cubic graph G is called a Kotzig frame if the contracted graph G/H is even and every non-circuit ...
متن کاملCycle double covers and spanning minors I
Define a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which each pair of colours form a Hamiltonian cycle. We show that every cubic graph with spanning subgraph consisting of a subdivision of a Kotzig graph together with even cycles has a cycle double cover, in fact a 6-CDC. We prove this for two other families of graphs similar to Kotzig graphs as well. In parti...
متن کاملOn Semi-perfect 1-Factorizations
The perfect 1-factorization conjecture by A. Kotzig [7] asserts the existence of a 1-factorization of a complete graph K2n in which any two 1-factors induce a Hamiltonian cycle. This conjecture is one of the prominent open problems in graph theory. Apart from its theoretical significance it has a number of applications, particularly in designing topologies for wireless communication. Recently, ...
متن کاملUniformities and covering properties for partial frames (II)
This paper is a continuation of [Uniformities and covering properties for partial frames (I)], in which we make use of the notion of a partial frame, which is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. After presenting there our axiomatization of partial frames, which we call $sels$-frames, we added structure, in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 33 شماره
صفحات -
تاریخ انتشار 2012